Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
891	Redundancy in Complete Sets Christian Glaßer∗, A. Pavan†, Alan L. Selman‡, Liyu Zhang§ July 6, 2005 Abstract We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2005-07-07 14:54:47 Complexity classes Structural complexity theory Conjectures Mathematical optimization P versus NP problem PP NP Polynomial hierarchy P Theoretical computer science Computational complexity theory Applied mathematics
892	Autoreducibility, Mitoticity, and Immunity Christian Glaßer∗, Mitsunori Ogihara†, A. Pavan‡, Alan L. Selman§, Liyu Zhang¶ December 27, 2004 Abstract We show the following results regarding complete sets. Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-12-27 11:32:14 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP PP Polynomial hierarchy PSPACE-complete P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
893	Bi-Immunity Separates Strong NP-Completeness Notions A. Pavan?1 and Alan L Selman2 1 2 Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2001-12-13 15:38:53 NP-complete NP P Combinatory logic P versus NP problem Computational complexity theory Theoretical computer science Complexity classes Applied mathematics
894	Disjoint NP-Pairs Christian Glaßer 1 Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2003-02-17 11:57:27 Complexity classes P versus NP problem NP-complete NP Oracle machine PP P Many-one reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics
895	Playaid by Greg Nichols[removed]These Union Pacific share tokens were designed to be used with the “Unlimited UP Stock” variant. Print, mount, cut, and most of all enjoy! U Un Add to Reading List Source URL: www-personal.umich.edu Language: English - Date: 2003-09-13 11:26:07 Complexity classes Secure Shell NP
896	2014 Area 4 NCHA Days Circuit Award Winners CLASS: HORSE: RIDER: Add to Reading List Source URL: montanacha.com Language: English - Date: 2014-06-09 14:11:52 American Quarter Horse Association Complexity classes NP Nuttall
897	Optimal acceptors and optimal proof systems Edward A. Hirsch? Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St. Petersburg[removed], Russia http://logic.pdmi.ras.ru/~hirsch/ Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2010-03-28 09:40:37 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP P versus NP problem Propositional proof system PP Mathematical proof Theoretical computer science Computational complexity theory Applied mathematics
898	Optimal heuristic algorithms for the image of an injective function∗ Edward A. Hirsch† Dmitry Itsykson† Valeria Nikolaenko‡ Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-08-01 04:42:41 Complexity classes Analysis of algorithms Quantum complexity theory Probabilistic complexity theory Randomized algorithm NP PP Algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
899	On an optimal randomized acceptor for graph nonisomorphism∗ Edward A. Hirsch†,‡ Dmitry Itsykson† November 9, 2011 Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-11-09 06:46:56 Analysis of algorithms Mathematical optimization Complexity classes Graph coloring NP-complete Randomized algorithm P versus NP problem NP Time complexity Theoretical computer science Computational complexity theory Applied mathematics
900	UNIVERSITY OF CALIFORNIA RIVERSIDE Distributed Symbolic Reachability Analysis A Dissertation submitted in partial satisfaction Add to Reading List Source URL: dad.ethanchung.com Language: English - Date: 2010-04-18 20:35:33 Applied mathematics Concurrency Models of computation Model checking Graph connectivity Petri net Hash table Reachability Algorithm Theoretical computer science Computing Complexity classes

UPDATE